An Imanishism-based Genetic Algorithm for sampling Various Pareto-optimal Solutions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Imanishism-Based Genetic Algorithm for Sampling Various Pareto-Optimal Solutions: An Application to the Multiobjective Resource Division Problem

For sampling various solutions from the entire Pareto front of the multiobjective resource division problem, a new Genetic Algorithm (GA) based on an evolutionary theory advocated by Kinji Imanishi is proposed. First, two types of distance between two individuals, namely, structural and functional distances, are introduced and used to define four types of relation between them, namely, homogene...

متن کامل

Pareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm

Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...

متن کامل

Integrated Circuit Channel Routing using a Pareto-Optimal Genetic Algorithm

An important part of the integrated circuit design process is the channel routing stage, which determines how to interconnect components that are arranged in sets of rows. The channel routing problem has been shown to be NP-complete, thus this problem is often solved using genetic algorithms. The traditional objective for most channel routers is to minimize total area required to complete routi...

متن کامل

Improved Sampling of the Pareto-Front in Multiobjective Genetic Optimizations by Steady-State Evolution: A Pareto Converging Genetic Algorithm

Previous work on multiobjective genetic algorithms has been focused on preventing genetic drift and the issue of convergence has been given little attention. In this paper, we present a simple steady-state strategy, Pareto Converging Genetic Algorithm (PCGA), which naturally samples the solution space and ensures population advancement towards the Pareto-front. PCGA eliminates the need for shar...

متن کامل

Optimal Path Diagnosis by Genetic Algorithm for NoCs

Nowadays Network-on-Chips is used instead of System-on-Chips for better performance. This paper presents a new algorithm to find a shorter path, and shows that genetic algorithm is a potential technique for solving routing problem for mesh topology in on-chip-network.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems

سال: 2001

ISSN: 0385-4221,1348-8155

DOI: 10.1541/ieejeiss1987.121.6_992